Try these now (think–pair–share):
- Which algorithm finds the fewest-edge path in an unweighted graph?
- In undirected DFS, when does a visited neighbor indicate a cycle?
- What’s the worst-case BFS memory footprint related to—depth or width?
Retrieval practice cements concepts. Click the cards on the right to check your answers.